The complementary unboundedness of dual feasible solution sets in convex programming
نویسندگان
چکیده
منابع مشابه
Characterizations of solution sets of cone-constrained convex programming problems
In this paper, we consider a type of cone-constrained convex program in finitedimensional space, and are interested in characterization of the solution set of this convex program with the help of the Lagrange multiplier. We establish necessary conditions for a feasible point being an optimal solution. Moreover, some necessary conditions and sufficient conditions are established which simplifies...
متن کاملOn Unboundedness of Generalized Solution Sets for Interval Linear Systems
The work presents a necessary and sufficient condition for the generalized AE-solution sets to interval linear systems of equations to be unbounded. The criterion requires solvability of one of the totality of 2 linear inequalities constructed from the initial interval system. It is shown that the problem of recognizing the boundedness of AE-solution sets is NP-complete in general.
متن کاملDisjunctive Programming: Properties of the Convex Hull of Feasible Points
In this paper we characterize the convex hull of feasible points for a disjunctive program, a class of problems which subsumes pure and mixed integer programs and many other nonconvex programming problems. Two representations are given for the convex hull of feasible points. each of which provides linear programming equivalents of the disjunctive program. The first one involves a number of new ...
متن کاملConvex games and feasible sets in control theory
The presented TEM-model describes the economical interaction between several actors (players) which intend to minimize their emissions (Ei) caused by technologies (Ti) by means of expenditures of money (Mi) or nancial means, respectively. The index stands for the i-th player, i = 1; : : : ; n. The players are linked by technical cooperations and the market, which expresses itself in the nonline...
متن کاملPrimal-dual Solution Perturbations in Convex Optimization
Solutions to optimization problems of convex type are typically characterized by saddle point conditions in which the primal vector is paired with a dual ‘multiplier’ vector. This paper investigates the behavior of such a primal-dual pair with respect to perturbations in parameters on which the problem depends. A necessary and sufficient condition in terms of certain matrices is developed for t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 1977
ISSN: 0025-5610,1436-4646
DOI: 10.1007/bf01593806